The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields

نویسندگان

  • Maria Bras-Amorós
  • Michael E. O'Sullivan
چکیده

Garcia and Stichtenoth discovered two towers of function fields that meet the Drinfeld-Vlăduţ bound on the ratio of the number of points to the genus. For one of these towers, Garcia, Pellikaan and Torres derived a recursive description of theWeierstrass semigroups associated to a tower of points on the associated curves. In this article, a non-recursive description of the semigroups is given and from this the enumeration of each of the semigroups is derived as well as its inverse. This enables us to find an explicit formula for the order (Feng-Rao) bound on the minimum distance of the associated one-point codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearly linear time encodable codes beating the Gilbert-Varshamov bound

We construct explicit nearly linear time encodable error-correcting codes beating the Gilbert-Varshamov bound. Our codes are algebraic geometry codes built from the Garcia-Stichtenoth function field tower and beat the Gilbert-Varshamov bound for alphabet sizes at least $19^2$. Messages are identified with functions in certain Riemann-Roch spaces associated with divisors supported on multiple pl...

متن کامل

Towards a Basis for the Space of Regular Functions in a Tower of Function Elds Meeting the Drinfeld-vladut Bound

In this paper, a convenient set of functions is identiied whose span includes all functions in a tower of function elds of Garcia and Stichtenoth that have poles only at the place at innnity. The latter set is of interest in the construction of long and eecient "one-point" AG codes.

متن کامل

A Note on an Asymptotically Good Tame Tower

The explicit construction of function fields tower with many rational points relative to the genus in the tower play a key role for the construction of asymptotically good algebraic-geometric codes. In 1997 Garcia, Stichtenoth and Thomas [6] exhibited two recursive asymptotically good Kummer towers over any non-prime field. Wulftange determined the limit of one tower in his PhD thesis [13]. In ...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

A New Tower Over Cubic Finite Fields

We present a new explicit tower of function fields (Fn)n≥0 over the finite field with ` = q3 elements, where the limit of the ratios (number of rational places of Fn)/(genus of Fn) is bigger or equal to 2(q2 − 1)/(q + 2). This tower contains as a subtower the tower which was introduced by Bezerra– Garcia–Stichtenoth (see [3]), and in the particular case q = 2 it coincides with the tower of van ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0609161  شماره 

صفحات  -

تاریخ انتشار 2006